Mesh repairing using topology graphs
نویسندگان
چکیده
منابع مشابه
Coloring graphs using topology
Higher dimensional graphs can be used to color 2dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More effic...
متن کاملAn Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملMinimum Self-Repairing Graphs
A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of remaining vertices of the graph. We completely characterize the class of minimum self-repairing graphs, which have the fewest edges for a given number of vertices. 1 Preliminaries In this paper, we investigate the class of graphs which we call self...
متن کاملProgressive Gap Closing for Mesh Repairing
Modern 3D acquisition and modeling tools generate high-quality, detailed geometric models. However, in order to cope with the associated complexity, several mesh decimation methods have been developed in the recent years. On the other hand, a common problem of geometric modeling tools is the generation of consistent three-dimensional meshes. Most of these programs output meshes containing degen...
متن کاملRepairing topological inconsistency of mesh sequences
We propose a novel approach for repairing topological inconsistency of mesh sequences with a few user interactions. The main idea of our approach is to leverage curve skeletons to detect the inconsistency of a mesh sequence. The skeleton of one mesh in the sequence is edited by user, which produces a prototype skeleton. We propagate this prototype using graph matching in-between frames. By usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Design and Engineering
سال: 2020
ISSN: 2288-5048
DOI: 10.1093/jcde/qwaa076